/*
The MIT License (MIT)

Copyright (c) 2013 Mike Dapiran, Brian May, Richard Pospesel, and Bert Wierenga

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software 
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#pragma once
namespace Hogshead
{
	namespace Common
	{
		
		// Lists
		template <typename T> class IList;	// pure virutal void, provides some basic stuff like sorting and shuffling

		template <typename T> class Vector;
		template <typename T> class ArrayList;
		template <typename T> class LinkedList;

		// Other
		template <typename T> class Stack;
		template <typename Key, typename Value> class HashTable;
		
		template <typename T> class Array1D;
		template <typename T> class Array2D;

		template <typename T> class Table;
		template <typename Key> class HashSet;

		// Containers
		template<typename A, typename B> struct Pair;
		template<typename A, typename B, typename C> struct Triplet;
		template<typename A, typename B, typename C, typename D> struct Tuple;

		// Enumerator
		template<typename T> class IEnumerator;

		// static class for common functions
		class HashFunctions;
		class EqualityFunctions;

		class MappedBlock;
	}
}

#include "DataStructures\HashFunctions.h"
#include "DataStructures\EqualityFunctions.h"


#include "DataStructures\IList.h"
#include "DataStructures\Vector.h"
#include "DataStructures\ArrayList.h"
#include "DataStructures\LinkedList.h"

#include "DataStructures\Stack.h"

#include "DataStructures\HashTable.h"
#include "DataStructures\MappedBlock.h"

#include "DataStructures\Array2D.h"
#include "DataStructures\Array1d.h"
#include "DataStructures\IEnumerator.h"

#include "DataStructures\Pair.h"
#include "DataStructures\Triplet.h"
#include "DataStructures\Tuple.h"

#include "DataStructures\Table.h"
#include "DataStructures\HashSet.h"

#include "DataStructures\MinHeap.h"